A least-squares functional for solving inverse Sturm–Liouville problems
نویسندگان
چکیده
منابع مشابه
A Least Squares Functional for Solving Inverse Sturm-Liouville Problems
Abstract. We present a variational algorithm for solving the classical inverse Sturm-Liouville problem in one dimension when two spectra are given. All critical points of the least squares functional are at global minima, which justifies minimization by a (conjugate) gradient descent algorithm. Numerical examples show that the resulting algorithm works quite reliable without tuning for particul...
متن کاملSolving Rank-Deficient Linear Least-Squares Problems*
Numerical solution of linear least-squares problems is a key computational task in science and engineering. Effective algorithms have been developed for the linear least-squares problems in which the underlying matrices have full rank and are well-conditioned. However, there are few efficient and robust approaches to solving the linear least-squares problems in which the underlying matrices are...
متن کاملSDLS: a Matlab package for solving conic least-squares problems
This document is an introduction to the Matlab package SDLS (Semi-Definite Least-Squares) for solving least-squares problems over convex symmetric cones. The package is shortly presented through the addressed problem, a sketch of the implemented algorithm, the syntax and calling sequences, a simple numerical example and some more advanced features. The implemented method consists in solving the...
متن کاملA Fast Algorithm for Solving Regularized Total Least Squares Problems
The total least squares (TLS) method is a successful approach for linear problems if both the system matrix and the right hand side are contaminated by some noise. For ill-posed TLS problems Renaut and Guo [SIAM J. Matrix Anal. Appl., 26 (2005), pp. 457 476] suggested an iterative method which is based on a sequence of linear eigenvalue problems. Here we analyze this method carefully, and we ac...
متن کاملApproximate Generalized Inverse Preconditioning Methods for Least Squares Problems
iv erative methods to solve least squares problems more efficiently. We especially focused on one kind of preconditioners, in which preconditioners are the approximate generalized inverses of the coefficient matrices of the least squares problems. We proposed two different approaches for how to construct the approximate generalized inverses of the coefficient matrices: one is based on the Minim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inverse Problems
سال: 2005
ISSN: 0266-5611,1361-6420
DOI: 10.1088/0266-5611/21/6/013